Bi-criteria Scheduling of a Flowshop Manufacturing Cell with Sequence Dependent Setup Times
نویسندگان
چکیده
This paper considers a flowshop scheduling problem of a manufacturing cell that contains families of jobs whose setup times are dependent on the manufacturing ............ sequence of the families. Two objectives, namely the makespan and total flow time, have been considered simultaneously in this work. Since minimization of each of these two objectives is an NpHard problem, a Multi-Objective Genetic Algorithm (MOGA) has been proposed to deal with the bi-criteria optimization problem. The performance of the proposed MOGA is compared with the makespan and total flow time lower bounds. The proposed MOGA obtained solutions that only deviate by an average of 1% from the lower bounds. Future research will develop more efficient lower bounds for the total flow time and also compare the proposed method with other multi-objective meta-heuristics.
منابع مشابه
A bi-objective model for the assembly flow shop scheduling problem with sequence dependent setup times and considering energy consumption
متن کامل
A Multi-objective Immune System for a New Bi-objective Permutation Flowshop Problem with Sequence-dependent Setup Times
We present a new mathematical model for a permutation flowshop scheduling problem with sequence-dependent setup times considering minimization of two objectives, namely makespan and weighted mean total earliness/tardiness. Only small-sized problems with up to 20 jobs can be solved by the proposed integer programming approach. Thus, an effective multi-objective immune system (MOIS) is ...
متن کاملMeta heuristic for Minimizing Makespan in a Flow-line Manufacturing Cell with Sequence Dependent Family Setup Times
This paper presents a new mathematical model for the problem of scheduling part families and jobs within each part family in a flow line manufacturing cell where the setup times for each family are sequence dependent and it is desired to minimize the maximum completion time of the last job on the last machine (makespan) while processing parts (jobs) in each family together. Gaining an optimal s...
متن کاملMinimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times
The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed ...
متن کاملLot Streaming in No-wait Multi Product Flowshop Considering Sequence Dependent Setup Times and Position Based Learning Factors
This paper considers a no-wait multi product flowshop scheduling problem with sequence dependent setup times. Lot streaming divide the lots of products into portions called sublots in order to reduce the lead times and work-in-process, and increase the machine utilization rates. The objective is to minimize the makespan. To clarify the system, mathematical model of the problem is presented. Sin...
متن کامل